package easy;

import util.PrintUtils;

public class Solution_1137 {

    private int[] arr = new int[]{0,1,1,2,4,7,13,24,44,81,149,274,504,927,1705,3136,5768,10609,19513,35890,66012,121415,223317,410744,755476,1389537,2555757,4700770,8646064,15902591,29249425,53798080,98950096,181997601,334745777,615693474,1132436852,2082876103};

    public int tribonacci(int n) {
        /*if (n < 3) {
            return arr[n];
        }
        return tribonacci(n - 1) + tribonacci(n - 2) + tribonacci(n - 3);*/
        return arr[n];
    }

    public static void main(String[] args) {
        Solution_1137 model = new Solution_1137();
        /*int[] a = new int[38];
        for (int i = 0; i <= 37; i++) {
            a[i] = model.tribonacci(i);
        }
        PrintUtils.arrayInt(a);*/
        System.out.println(model.arr.length);
    }
}
